A general geometric construction of coordinates in a convex simplicial polytope
نویسندگان
چکیده
Barycentric coordinates are a fundamental concept in computer graphics and geometric modeling. We extend the geometric construction of Floater’s mean value coordinates [8,11] to a general form that is capable of constructing a family of coordinates in a convex 2D polygon, 3D triangular polyhedron, or a higher-dimensional simplicial polytope. This family unifies previously known coordinates, including Wachspress coordinates, mean value coordinates and discrete harmonic coordinates, in a simple geometric framework. Using the construction, we are able to create a new set of coordinates in 3D and higher dimensions and study its relation with known coordinates. We show that our general construction is complete, that is, the resulting family includes all possible coordinates in any convex simplicial polytope.
منابع مشابه
Construction of Scalar and Vector Finite Element Families on Polygonal and Polyhedral Meshes
We combine theoretical results from polytope domain meshing, generalized barycentric coordinates, and finite element exterior calculus to construct scalar- and vector-valued basis functions for conforming finite element methods on generic convex polytope meshes in dimensions 2 and 3. Our construction recovers well-known bases for the lowest order Nédélec, Raviart-Thomas, and Brezzi-Douglas-Mari...
متن کاملThe Number of Faces of a Simplicial Convex Polytope
Let P be a simplicial convex d-polytope with fi = fi(P) faces of dimension i. of integers was necessary and sufficient for f to be the f-vector of some simplicial convex d-polytope. Billera and Lee [l] proved the sufficiency of McMullen's condition. In this paper we prove necessity. Thus McMullen's conjecture is completely verified. First we describe McMullen's condition. Given a simplicial con...
متن کاملBarycentric coordinates for convex polytopes
An extension of the standard barycentric coordinate functions for simplices to arbitrary convex polytopes is described. The key to this extension is the construction, for a given convex polytope, of a unique polynomial associated with that polytope. This polynomial, the adjoint of the polytope, generalizes a previous two-dimensional construction described by Wachspress. The barycentric coordina...
متن کاملMcMullen's Conditions and Some Lower Bounds for General Convex Polytopes
Convex polytopes are the d-dimensional analogues of 2-dimensional convex polygones and 3-dimensional convex polyhedra. A polytope is a bounded convex set in R d that is the intersection of a finite number of closed halfspaces. The faces of a polytope are its intersections with supporting hyperplanes. The/-dimensional faces are called the i-faces and f i ( P ) denotes the number of i-faces of a ...
متن کاملVelocity interpolation and streamline tracing on irregular geometries
Streamline tracing on irregular grids requires reliable interpolation of velocity fields. We propose a new method for direct streamline tracing on polygon and polytope cells. While some numerical methods provide a basis function that can be used for interpolation, other methods provide only the fluxes at the faces of the elements. We introduce the concept of full field and raw field methods. Fu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computer Aided Geometric Design
دوره 24 شماره
صفحات -
تاریخ انتشار 2007